<?php
/**
 * @title 208. 实现 Trie (前缀树)
 * @author start2004
 */

// ini_set("memory_limit", "128M");

// class Solution {
//
//     function find() {
//
//     }
// }

class TrieTree
{
    public $val;
    public $isWord;
    public $next;

    public function __construct($val = null, $isWord = false, $next = [])
    {
        $this->val = $val;
        $this->isWord = $isWord;
        $this->next = $next;
    }
}

class Trie {
    /**
     */
    function __construct() {
        $this->trieTree = new TrieTree();
    }

    /**
     * @param String $word
     * @return NULL
     */
    function insert($word) {
        /**
         * @since 2023-12-28 TrieTree沿着next往下找，找到最后一个字符，标记为单词
         */
        $trieTree = $this->trieTree;
        for($i=0; $i<strlen($word); $i++){
            $char = $word[$i];
            if(!isset($trieTree->next[$char])){
                $trieTree->next[$char] = new TrieTree($char);
            } else {}
            $trieTree = $trieTree->next[$char];
        }
        $trieTree->isWord = true;
    }

    /**
     * @param String $word
     * @return Boolean
     */
    function search($word) {
        /**
         * @since 2023-12-28 TrieTree沿着next往下找，找到最后一个字符，查看isWord
         */
        $trieTree = $this->trieTree;
        for($i=0; $i<strlen($word); $i++){
            $char = $word[$i];
            if(!isset($trieTree->next[$char])){
                return false;
            } else {
                $trieTree = $trieTree->next[$char];
            }
        }

        /**
         * @return Boolean
         */
        return $trieTree->isWord;
    }

    /**
     * @param String $prefix
     * @return Boolean
     */
    function startsWith($prefix) {
        /**
         * @since 2023-12-28 TrieTree沿着next往下找，找到最后一个字符，查看isWord
         */
        $trieTree = $this->trieTree;
        for($i=0; $i<strlen($prefix); $i++){
            $char = $prefix[$i];
            if(!isset($trieTree->next[$char])){
                return false;
            } else {
                $trieTree = $trieTree->next[$char];
            }
        }

        /**
         * @return Boolean
         */
        return true;
    }
}

/**
 * Your Trie object will be instantiated and called as such:
 * $obj = Trie();
 * $obj->insert($word);
 * $ret_2 = $obj->search($word);
 * $ret_3 = $obj->startsWith($prefix);
 */


/**
 * @url http://127.0.0.1/leetcode/202312/2023.12.28_7.php
 */
$datas = [

];

include_once dirname(__DIR__) . DIRECTORY_SEPARATOR ."xhprof.php";
$xhprof = new Xhprof();
foreach ($datas as $data){
    if(count($data) <= 20){
        var_dump($data);
    } else {
        var_dump(count($data));
    }

    $obj = new Solution();
    $result = $obj->(...$data);
    // $result = $obj->($xhprof->tree($data));
    // $result = $obj->($xhprof->listNode($data));
    // $result = $obj->find(...$data);
    var_dump($result);
    // if(count($result)<=20){
    //     var_dump($result);
    // } else {
    //     var_dump(count($result));
    // }
    echo str_repeat(PHP_EOL, 3);
    echo str_repeat("<br>", 3);
}

// foreach ($datas as $data){
//     $obj = new $data[0][0](...$data[1][0]);
//
//     for ($i=1; $i<count($data[0]); $i++){
//         $func = $data[0][$i];
//         $param = $data[1][$i];
//         $result = $obj->$func(...$param);
//
//         echo $data[0][$i] ."(\"". implode(",", $data[1][$i]) ."\") ";
//             if($result === true){
//                 echo "True";
//             } elseif($result === false) {
//                 echo "False";
//             } elseif($result === null) {
//                 echo "Null";
//             } elseif(is_array($result)) {
//                 var_dump($result);
//             } else {
//                 echo $result;
//             }
//         echo PHP_EOL;
//     }
//
//     echo str_repeat(PHP_EOL, 3);
// }
$xhprof->end();
